Priority and Deadline Assignment to Triggered Transactions in
نویسندگان
چکیده
A Distributed Real-time Active Database System (DRTADBS) reacts to the critical events occurred in the external environment by triggering of transactions. In this paper, the priority and deadline assignment to triggered transactions under two coupling modes, the deferred and immediate, in a DRTADBS is discussed. Two new approaches, the data state dependent (DSD) and the transaction-data deadline (TDD) are proposed to assign criticality and deadlines to the triggered transactions, respectively. In the DSD approach, the criticality of a triggered transaction is defined according to the state of the temporal data object which is responsible for its triggering. The objective of the DSD approach is to increase the number of commit achieved by the triggered transactions especially the more critical ones. The performance of these two approaches under the two coupling modes has been investigated. The results show that the DSD approach is more effective under the immediate coupling mode than under the deferred coupling mode due to the late creation of the triggered transactions under the deferred coupling mode. The TDD approach can improve the system performance under both deferred and immediate coupling mode.
منابع مشابه
Priority and deadline assignment to triggered transactions in distributed real-time active databases
A distributed real-time active database system (DRTADBS) reacts to the critical events that occurred in the external environment by triggering of transactions. In this paper, the priority and deadline assignment to triggered transactions under two coupling modes, the deferred and immediate, in a DRTADBS is discussed. Two new approaches, the data state dependent (DSD) and the transaction-data de...
متن کاملUtilization of execution histories in scheduling real-time database transactions
Real-time database systems support data processing needs of real-time systems where transactions have time constraints. Here we consider repetitively executed transactions, and assume that execution histories are logged. A well-known priority assignment technique called earliest-deadline-first is biased towards short transactions in which short transactions have better chances of completing the...
متن کاملImpact of priority assignment on optimistic concurrency control in distributed real-time databases
In the studies of real-time concurrency control protocols (RT-CCPs), it is always assumed that earliest deadline first (EDF) is employed as the CPU scheduling algorithm. However, using purely (ultimate) deadline for priority assignment may not be suitable for distributed real-time database systems (DRTDBS) in which there exist different kinds of transactions, such as global and local transactio...
متن کاملHierarchical AED Scheduling Algorithm for Real-Time Networks
Earlier studies have observed that in moderately-loaded real-time systems, using an earliest deadline policy to schedule tasks results in the fewest missed deadlines. However, when the real-time system is overloaded an earliest deadline schedule performs worse than most other policies. This is due to the earliest deadline giving the highest priority to the tasks that are close to missing their ...
متن کاملEarliest Deadline Scheduling for Real-Time Database Systems
Earlier studies have observed that in moderately-loaded real-time database systems, using an Earliest Deadline policy to schedule tasks results in the fewest missed deadlines. When the real-time system is overloaded, however, an Earliest Deadline schedule performs worse than most other policies. This is due to Earliest Deadline giving the highest priority to transactions that are close to missi...
متن کامل